Proposed solution for thirsty men problem#42
Open
matingnet wants to merge 1 commit intobellaj:masterfrom
Open
Conversation
Signed-off-by: matingnet <medaymanedhimni@gmail.com>
Owner
|
@matingnet interesting answer but a major problem is not handled. The last holder can just refuse to put the last cup because his cup was put before and if he does the winners will get the water and not him why would he end the process? |
Author
|
@bellaj Thanks for bringing this up! To fix the issue of the last holder potentially refusing to place the final cup, I’d suggest having everyone place their cups at the same time after encrypting their positions. If two players end up picking the same spot, the pourer can step in during the encryption phase, check the values, and ask the guest to redo their calculation until there’s no conflict. This way, we keep things fair and avoid any disruptions. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This pull request solves the Thirsty Men Problem by shuffling cups, using encryption for secure placement, and validating the process to ensure fairness. It promotes cooperation and fair distribution of responsibilities, with a simulation demonstrating the process for three players.